Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem

The bilevel programming problems are useful tools for solving the hierarchy decision problems. In this paper, a genetic algorithm based on the simplexmethod is constructed to solve the linear-quadratic bilevel programming problem (LQBP). By use of Kuhn–Tucker conditions of the lower level programming, the LQBP is transformed into a single level programming which can be simplified to a linear programming by the chromosome according to the rule. Thus, in our proposed genetic algorithm, only the linear programming is solved by the simplex method to obtain the feasibility and fitness value of the chromosome. Finally, the feasibility of the proposed approach is demonstrated by the example. Crown Copyright© 2008 Published by Elsevier Ltd. All rights reserved.